Learning Logic Programs with Unary Partial Function Graph Background Knowledge
نویسندگان
چکیده
The product homomorphism method is a combinatorial tool that can be used to develop polynomial PAC-learning algorithms in predicate logic. Using the product homomorphism method, we show that a single nonrecursive definite Horn clause is polynomially PAC-learnable if the background knowledge is a function-free extensional database over a single binary predicate and the ground atoms in the background knowledge form a unary partial function. That is, the background knowledge corresponds to a directed graph, where each node has outdegree at most 1. The proof is based on a detailed analysis of products and homomorphisms of the class of digraphs corresponding to unary partial functions.
منابع مشابه
Multitask Kernel-based Learning with Logic Constraints
This paper presents a general framework to integrate prior knowledge in the form of logic constraints among a set of task functions into kernel machines. The logic propositions provide a partial representation of the environment, in which the learner operates, that is exploited by the learning algorithm together with the information available in the supervised examples. In particular, we consid...
متن کاملOn Partial Features in the DLF Dialects of Description Logic with Inverse Features
The DLF dialects of description logic are fragments of first order logic with underlying signatures based on unary predicate symbols and on unary function symbols interpreted as total functions. In earlier work, we have shown how computational properties of logical consequence for dialects of this family without inverse features are preserved when unary function symbols are interpreted instead ...
متن کاملOn Role Logic
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of de Bruijn’s notation for lambda calculus, an encoding of first-order logic in lambda calculus, and a simple rule for implicit arguments of unary and binary predicates. The unrestricted version of role logic has the exp...
متن کاملFeature Constraint Logics for Unification Grammars
This paper studies feature description languages that have been developed for use in uniication grammars, logic programming and knowledge representation. The distinctive notational primitive of these languages are features that can be understood as unary partial functions on a domain of abstract objects. We show that feature description languages can be captured naturally as sublanguages of rst...
متن کاملUniversitt a Degli Studi Di Bologna Deis Extensions of Logic Programming as Representation Languages for Machine Learning Extensions of Logic Programming as Representation Languages for Machine Learning
The representation language of Machine Learning has undergone a substantial evolution, starting from numerical descriptions to an attribute-value representations and nally to rst order logic languages. In particular, Logic Programming has recently been studied as a representation language for learning in the research area of Inductive Logic Programming. The contribution of this thesis is twofol...
متن کامل